A New Algorithm and Open Problems in Three-Dimensional Orthogonal Graph Drawing
نویسنده
چکیده
In this paper we present an algorithm for 3-D orthogonal drawing of arbitrary degree n-vertex m-edge multigraphs with O(m 2 = p n) bounding box volume and 6 bends per edge route. This is the smallest known bound on the bounding box volume of 3-D orthogonal multigraph drawings. We continue the study of the tradeoo between bounding box volume and the number of bends in orthogonal graph drawings through a reened algorithm with O(m 2) bounding box volume and 5 bends per edge route. Many open problems in 3-D orthogonal graph drawing are presented and potential avenues for their solution are discussed.
منابع مشابه
Complexity Results for Three-Dimensional Orthogonal Graph Drawing
In this paper we consider the problem of finding three-dimensional orthogonal drawings of maximum degree six graphs from the computational complexity perspective. We introduce the 3SAT reduction framework which can be used to prove the NP-hardness of finding three-dimensional orthogonal drawings with specific constraints. By using the framework we show that, given a three-dimensional orthogonal...
متن کاملAn Algorithm for Three-Dimensional Orthogonal Graph Drawing
In this paper we present an algorithm for 3-dimensional orthogonal graph drawing based on the movement of vertices from an initial layout along the main diagonal of a cube. For an n-vertex m-edge graph with maximum degree six, the algorithm produces drawings with bounding box volume at most 2.37n and with a total of 7m/3 bends, using no more than 4 bends per edge route. For maximum degree five ...
متن کاملTwo-Bend Three-Dimensional Orthogonal Grid Drawing of Maximum Degree Five Graphs
Some recent algorithms for 3-dimensional orthogonal graph drawing use no more than 3 bends per edge route. It is unknown if there exists a graph requiring a 3-bend edge route. In this paper we present an algorithm for 2-bend 3-dimensional orthogonal grid drawing of maximum degree 5 graphs. In addition 2-bend 3-dimensional grid drawings of the 6-regular multi-partite graphs are given.
متن کاملTowards a 2-Bends Algorithm for Three-Dimensional Orthogonal Graph Drawing
Two recent algorithms for 3-dimensional orthogonal graph drawing both guarantee no more than 3 bends per edge, yet no graph has been shown to necessarily require a 3-bend edge. In this paper we present progress towards an algorithm which will produce an orthogonal graph drawing of an arbitrary graph with no more than 2 bends per edge.
متن کامل1-Bend 3-D Orthogonal Box-Drawings: Two Open Problems Solved
This paper studies three-dimensional orthogonal box-drawings where edge-routes have at most one bend. Two open problems for such drawings are: (1) Does every drawing of Kn have volume Ω(n )? (2) Is there a drawing of Kn for which additionally the vertices are represented by cubes with surface O(n)? This paper answers both questions in the negative, and provides related results concerning volume...
متن کامل